Heuristic search

Heuristic Search vs. Exhaustive Search

A theorem proving system embodying a systematic search procedure is de sen bed. Al though the search spaces are usually infinite, and not even locally finite, the asymmetric way in which thev are generated results in a speed that is es 11ma-ted to be one to two orders of magnitude faster than the theorem provers of Quinlan and Hunt, and Chang and the problem-solver of Kikes, to whi c h this sys...

Heuristic Search in Planning

Constrained Heuristic Search

We propose a model of problem solving that provides both structure and focus to search. The model achieves this by combining constraint satisfaction wi th heuristic search. We introduce the concepts of topology and texture to characterize problem structure and areas to focus attention respectively. The resulting model reduces search complexity and provides a more principled explanation of the n...

The Bandwidth Heuristic Search

By placing various restrictions on the heuristic estimator it is possible to constrain the heuristic search process to fit specific needs. This paper introduces a new restriction upon the heuristic, called the "bandwidth" condition, that enables the ordered search to better cope with time and space difficulties. In particular, the effect of error within the heuristic is considered in detail. Be...

Sparse sampling heuristic search

In the article A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes, Kearns et al show that there’re now theoratical boundary’s to solve an mdp with an infinite state space in a such a way that the running time has no dependency’s on the size of the statespace. To come to this conclusion they introduce an algorithm that uses a sparse look-a-head tree to selec...